On Secret Sharing Schemes with Extended Capabilities
نویسندگان
چکیده
Secret sharing allows split control over the secret. Secret parts known as secret shares are distributed to different shareholders (locations). Secret can be recovered upon combination of sufficient number of shares. Research into theoretical foundations, development of widespread applications, as well as, new attacks resulted in great need for extra features of existing schemes. We describe extended capabilities for secret sharing schemes. List of discussed issues contains (but is not limited to): multiple and different size sets of shareholders, schemes activation, multisecret schemes, cheating detection, secret shares renewal/maintaince, missing shares recovery. Next, research results into extended capabilities for Karin-Green-Hellman scheme are presented. We concentrate on Proactive Secret Sharing (PSS) and Publicly Verifiable Secret Sharing (PVSS). Results are in the form of collections of algorithm in pseudocode, that can be easily implemented. Finally, we discuss trade-offs between secret security and extended capabilities.
منابع مشابه
Security Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملAnalyzing Extended Secret Sharing Schemes based on Share Size
Secret sharing is the technique in which secret is distributed among n participants. Each participant has unique secret share. Secret can be recovered only after sufficient number of shares (k out of n) combined together. In many circumstances secret sharing has to provide additional capabilities to satisfy certain requirements. Such capabilities include proactive redistribution of shares, veri...
متن کاملOn ASGS framework: general requirements and an example of implementation
In the paper we propose general framework for Automatic Secret Generation and Sharing (ASGS) that should be independent of underlying secret sharing scheme. ASGS allows to prevent the dealer from knowing the secret or even to eliminate him at all. Two situations are discussed. First concerns simultaneous generation and sharing of the random, prior nonexistent secret. Such a secret remains unkno...
متن کاملAn Explication of Multifarious Secret Sharing Schemes
The idea of secret sharing is to start with a secret, divide it into pieces called shares, which are then distributed amongst participants by the dealer. Only certain authorized subsets of participants can reconstruct the original secret. Applications for secret sharing schemes seem to be getting more important nowadays. For many circumstances, secret sharing has to provide more flexibility and...
متن کامل